An Exact Sequence of Weighted Nash Complexes
نویسنده
چکیده
Given a three-dimensional complex algebraic variety with isolated singular point and a sufficiently fine complete resolution of the singularity, we can make a careful choice of hyperplane that allows us to construct an exact sequence of weighted Nash complexes.
منابع مشابه
Prevention of Nonalcoholic Steatohepatitis in Rats by Two Manganese-Salen Complexes
Background: Nonalcoholic steatohepatitis (NASH), a progressive stage of nonalcoholic fatty liver disease (NAFLD), is characterized by steatosis with inflammation. Investigations have suggested that oxidative stress may play an important role in the progress of NAFLD to NASH. To provide further insights into beneficial effects of antioxidants in NASH prevention, we employed two manganese-supero...
متن کاملOn the fine spectra of the Zweier matrix as an operator over the weighted sequence space $l_{p}(w)$
In the present paper, the ne spectrum of the Zweier matrix as anoperator over the weighted sequence space `p(w); have been examined.
متن کاملExtension of Hardy Inequality on Weighted Sequence Spaces
Let and be a sequence with non-negative entries. If , denote by the infimum of those satisfying the following inequality: whenever . The purpose of this paper is to give an upper bound for the norm of operator T on weighted sequence spaces d(w,p) and lp(w) and also e(w,?). We considered this problem for certain matrix operators such as Norlund, Weighted mean, Ceasaro and Copson ma...
متن کاملA fuzzy mixed-integer goal programming model for a parallel machine scheduling problem with sequence-dependent setup times and release dates
This paper presents a new mixed-integer goal programming (MIGP) model for a parallel machine scheduling problem with sequence-dependent setup times and release dates. Two objectives are considered in the model to minimize the total weighted flow time and the total weighted tardiness simultaneously. Due to the com-plexity of the above model and uncertainty involved in real-world scheduling probl...
متن کاملAn Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time
This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...
متن کامل